Categorification, Term Rewriting and the Knuth–bendix Procedure
نویسنده
چکیده
An axiomatization of a finitary, equational universal algebra by a convergent term rewrite system gives rise to a finite, coherent categorification of the algebra.
منابع مشابه
Equational Reasoning in Saturation-Based Theorem Proving
5 Rewriting Techniques for Equational Reasoning 9 5.1 Knuth-Bendix Completion . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9 5.1.1 Basic Concepts in Term Rewriting . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 10 5.1.2 The Completion Procedure . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 10 5.1.3 Ordered Rewriting . . . . . . . . ....
متن کاملCompletion of Unraveled Term Rewriting Systems toward Program Inversion of Injective Functions
Given a constructor term rewriting system defining injective functions, the inversion compiler proposed by Nishida, Sakai and Sakabe generates a confluent conditional term rewriting system, and unravels the conditional system into an unconditional term rewriting system. In general, the unconditional system is not confluent and thus not computationally equivalent to the conditional system. In th...
متن کاملAbstract Reduction Systems and Idea of Knuth-Bendix Completion Algorithm
Reduction Systems and Idea of Knuth-Bendix Completion Algorithm Grzegorz Bancerek Association of Mizar Users Białystok, Poland Summary. Educational content for abstract reduction systems concerning reduction, convertibility, normal forms, divergence and convergence, ChurchRosser property, term rewriting systems, and the idea of the Knuth-Bendix Completion Algorithm. The theory is based on [1].
متن کاملA Higher-Order Knuth-Bendix Procedure and Its Applications
The completeness (i.e. confluent and terminating) property is an important concept when using a term rewriting system (TRS) as a computational model of functional programming languages. Knuth and Bendix have proposed a procedure known as the KB procedure for generating a complete TRS. A TRS cannot, however, directly handle higher-order functions that are widely used in functional programming la...
متن کاملCombining Reductions and Computations in ReDuX
ReDuX [1, 4] is a term rewriting laboratory mainly aimed at theorem proving and completion procedures. ReDuX comprises several variants of Knuth-Bendix completion including a version supporting associative commutative operators and an inductive completion procedure. Several term orderings are available as well as a random term generator and a program to automatically analyze the set of irreduci...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010